Symmetric centrosymmetric matrix–vector multiplication
نویسندگان
چکیده
منابع مشابه
Centrosymmetric and pseudo-centrosymmetric structures refined as non-centrosymmetric.
The behaviour of the Flack parameter for centrosymmetric and pseudo-centrosymmetric crystal structures based on crystal structures published as being non-centrosymmetric is presented. It is confirmed for centrosymmetric structures that the value obtained for the Flack parameter is critically dependent on the Friedel coverage of the intensity data, approaching 0.5 for a coverage of 100% and stic...
متن کاملPeriodic symmetric functions, serial addition, and multiplication with neural networks
This paper investigates threshold based neural networks for periodic symmetric Boolean functions and some related operations. It is shown that any n-input variable periodic symmetric Boolean function can be implemented with a feedforward linear threshold-based neural network with size of O(log n) and depth also of O(log n), both measured in terms of neurons. The maximum weight and fan-in values...
متن کاملDepth-Efficient Threshold Circuits for Multiplication and Symmetric Function Computation
The multiplication operation and the computation of symmetric functions are fundamental problems in arithmetic and algebraic computation. We describe unit-weight threshold circuits to perform the multiplication of two n-bit integers, which have fan-in k, edge complexity O(n 2+1=d), and depth O(log d + log n= log k), for any xed integer d > 0. For a given fan-in, our constructions have considera...
متن کاملMultiplication Symmetric Convolution Property for Discrete Trigonometric Transforms
The symmetric-convolution multiplication (SCM) property of discrete trigonometric transforms (DTTs) based on unitary transform matrices is developed. Then as the reciprocity of this property, the novel multiplication symmetric-convolution (MSC) property of discrete trigonometric transforms, is developed.
متن کاملSymmetric digit sets for elliptic curve scalar multiplication without precomputation
We describe a method to perform scalar multiplication on two classes of ordinary elliptic curves, namely [Formula: see text] in prime characteristic [Formula: see text], and [Formula: see text] in prime characteristic [Formula: see text]. On these curves, the 4-th and 6-th roots of unity act as (computationally efficient) endomorphisms. In order to optimise the scalar multiplication, we conside...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2000
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(00)00232-9